Trading accuracy for speed in parallel simulated annealing with simultaneous moves

Trading accuracy for speed in parallel simulated annealing with simultaneous moves

A common approach to parallelizing simulated annealing to generate several perturbations to the current solution simultaneously, requiring synchronization to guarantee correct evaluation of the cost function. The cost of this synchronization may be reduced by allowing inaccuracies in the cost calculations. We provide a framework for understanding the theoretical implications of this approach ba...

A New Hybrid Parallel Simulated Annealing Algorithm for Travelling Salesman Problem with Multiple Transporters

In today’s competitive transportation systems, passengers search to find traveling agencies that are able to serve them efficiently considering both traveling time and transportation costs. In this paper, we present a new model for the traveling salesman problem with multiple transporters (TSPMT). In the proposed model, which is more applicable than the traditional versions, each city has diffe...

Algorithm Mapping with Parallel Simulated Annealing Algorithm Mapping with Parallel Simulated Annealing ?

This paper presents a parallel simulated annealing algorithm for solving the problem of mapping irregular parallel programs onto homogeneous processor arrays with regular topology. The algorithm constructs and uses joint transformations. These transformations guarantee a high degree of parallelism that is bounded below by d jNpj deg(Gp)+1 e, where jN p j is the number of task nodes in the mappe...

Neighborhood Parallel Simulated Annealing

Parallel Simulated Annealing Algorithms

n different nodes of the network. The two algorithms have been applied to the job shop scheduling problem (JSS) and the traveling salesman problem (TSP). Both algorithms showed very good performance in terms of solution time and solution quality. The rest of the paper is organized in the following fashion. Section II describes the simulated annealing technique. Section III presents the cluster ...